Approximate Subsumption for Complex Description Logics

نویسنده

  • Heiner Stuckenschmidt
چکیده

We present a non-standard interpretation for concept expressions in ALCQ that defines approximate notions of subsumption based on approximating a subset of the concept and role names. We present the non-standard semantics, and the corresponding notion of approximate subsumption, discuss its formal properties and show that is can be computed by syntactic manipulations of concept expressions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partial Matchmaking using Approximate Subsumption

Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of information integration and service discovery. A drawback of the direct use of subsumption as a matching criterion is the inability to compute partial matches and qualify the degree of mismatch. In this paper, we describe ...

متن کامل

Partial Matchmaking for complex Product and Service Descriptions

Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing offers and requests and standard methods from description logics reasoning have been proposed for computing matches. We argue that classical reasoning is not well suited for realistic scenarios as it does not allow to co...

متن کامل

A Proposal for a Glass-Box Approach for Subsumption Checking

Description logics have good representational properties and their computational properties are well understood. However, one of their main drawback is that their current reasoning algorithms have an inherent black-box nature, i.e they don’t make explicit how subsumption inferences are obtained. This is an important drawback for providing explanation or debugging services. Description logics wi...

متن کامل

Subsumption Propagation between Remote Ontologies in Distributed Description Logic

Distributed Description Logics (DDL) is a KR formalism that enables reasoning with multiple ontologies interconnected by directional semantic mapping. Subsumption propagation in DDL from one ontology to another as a result of mappings has been studied, but only for a simplified case when only two ontologies are involved. In this paper we study subsumption propagation in more complex cases, when...

متن کامل

Semantic Preferential Subsumption

We present a general preferential semantic framework for plausible subsumption in description logics, analogous to the KLM preferential semantics for propositional entailment. We introduce the notion of ordered interpretations for description logics, and use it to define two mutually dual non-deductive subsumption relations

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007